Bounds and constructions for n-e.c. tournaments
نویسندگان
چکیده
Few families of tournaments satisfying the n-e.c. adjacency property are known. We supply a new random construction for generating infinite families of vertex-transitive n-e.c. tournaments by considering circulant tournaments. Switching is used to generate new ne.c. tournaments of certain orders. With aid of a computer search, we demonstrate that there is a unique minimum order 3-e.c. tournament of order 19, and there are no 3-e.c. tournaments of orders 20, 21, and 22. We show that there are no 4-e.c. tournaments of orders 47 and 48 improving the lower bound for the minimum order of such a tournament.
منابع مشابه
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
A graph is n-e.c. (n-existentially closed) if for every pair of subsets U , W of the vertex set V of the graph such that U ∩W = / 0 and |U |+ |W | = n, there is a vertex v ∈ V − (U ∪W ) such all edges between v and U are present and no edges between v and W are present. A graph is strongly regular if it is a regular graph such that the number of vertices mutually adjacent to a pair of vertices ...
متن کاملOn an adjacency property of almost all tournaments
Let n be a positive integer. A tournament is called nexistentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / ∈ S which is directed toward every vertex in T and directed away from every vertex in S\T. We prove that there is a 2-e.c. tournament with k vertices if and only if k ≥ 7 and k 6= 8, and give explicit examples for all such o...
متن کاملImbalance in tournament designs
We introduce two measures of imbalance, the team imbalance, and the field imbalance, in a tournament design. In addition to an exhaustive study of imbalances in tournament designs with up to eight teams, we present some bounds on the imbalances, as well as recursive constructions for homogeneous tournaments.
متن کاملColoring tournaments with forbidden substructures
Coloring graphs is an important algorithmic problem in combinatorics with many applications in computer science. In this paper we study coloring tournaments. A chromatic number of a random tournament is of order Ω( n log(n)). The question arises whether the chromatic number can be proven to be smaller for more structured nontrivial classes of tournaments. We analyze the class of tournaments def...
متن کاملOn High-Dimensional Acyclic Tournaments
We study a high-dimensional analog for the notion of an acyclic (aka transitive) tournament. We give upper and lower bounds on the number of d-dimensional n-vertex acyclic tournaments. In addition, we prove that every n-vertex d-dimensional tournament contains an acyclic subtournament of (log1/d n) vertices and the bound is tight. This statement for tournaments (i.e., the case d = 1) is a well-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Contributions to Discrete Mathematics
دوره 5 شماره
صفحات -
تاریخ انتشار 2010